Polyhedral Mesh Generation
نویسندگان
چکیده
A new methodology to generate a hex-dominant mesh is presented. From a closed surface and an initial all-hex mesh that contains the closed surface, the proposed algorithm generates, by intersection, a new mostly-hex mesh that includes polyhedra located at the boundary of the geometrical domain. The polyhedra may be used as cells if the field simulation solver supports them or be decomposed into hexahedra and pyramids using a generalized mid-point-subdivision technique. This methodology is currently used to provide hex-dominant automatic mesh generation in the preprocessor pro*am of the CFD code STAR-CD.
منابع مشابه
Polyhedral Mesh Generation and Optimization for Non-manifold Domains
We present a preliminary method to generate polyhedral meshes of general non-manifold domains. The method is based on computing the dual of a general tetrahedral mesh. The resulting mesh respects the topology of the domain to the same extent as the input mesh. If the input tetrahedral mesh is Delaunay and well-centered, the resulting mesh is a Voronoi mesh with planar faces. For general tetrahe...
متن کاملPolyhedral Mesh Generation and A Treatise on Concave Geometrical Edges
Three methods are investigated to remove the concavity at the boundary edges and/or vertices during polyhedral mesh generation by a dual mesh method. The non-manifold elements insertion method is the first method examined. Concavity can be removed by inserting non-manifold surfaces along the concave edges and using them as an internal boundary before applying Delaunay mesh generation. Conical c...
متن کاملBoolean operations on arbitrary polyhedral meshes
A floating-point arithmetic algorithm designed for solving usual boolean operations (intersection, union, and difference) on arbitrary polyhedral meshes is described in this paper. It can be used in many preand post-processing applications in computational physics (e.g. cut-cell volume mesh generation or high order conservative remapping). The method provides conformal polyhedral meshes upon ex...
متن کاملAdaptive All-Hexahedral Mesh Generation Based on A Hybrid Octree and Bubble Packing
In this paper, a novel adaptive all-hexahedral (all-hex) mesh generation algorithm is proposed based on a hybrid octree. This hybrid octree consists of polyhedral cells and each grid point is always shared by eight cells by using a cutting procedure. A dual mesh with all-hex elements is then extracted by analyzing each grid point. Next, sphere or ellipsoid bubble packing is applied to improve t...
متن کاملOptimizing a Triangular Mesh for Shape Reconstruction from Images
In reconstructing 3-D from images based on feature points, one usually defines a triangular mesh that has these feature points as vertices and displays the scene as a polyhedron. If the scene itself is a polyhedron, however, some of the displayed edges may be inconsistent with the true shape. This paper presents a new technique for automatically eliminating such inconsistencies by using a speci...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000